<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Data Structures for Sets and Graphs: graphs/Graph.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Data Structures for Sets and Graphs
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.1.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark">&#160;</span>Macros</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_014563f092b9a36e69e485d819dd177d.html">graphs</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">Graph.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="Graph_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;</div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="preprocessor">#ifndef GRAPH_H_</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define GRAPH_H_</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="preprocessor">#include &lt;cstdio&gt;</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="preprocessor">#include &lt;math.h&gt;</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="BitMapDirectlyAddressedSet_8h.html">BitMapDirectlyAddressedSet.h</a>&quot;</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="BitTools_8h.html">BitTools.h</a>&quot;</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;</div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;</div>
<div class="line"><a name="l00020"></a><span class="lineno"><a class="code" href="Graph_8h.html#a520a09ff51dae131dd04388e4cff5267a6de81ce1f98c4f6a9cb9cc37e33dd305">   20</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">enum</span> <a class="code" href="Graph_8h.html#a520a09ff51dae131dd04388e4cff5267">GT</a> { <a class="code" href="Graph_8h.html#a520a09ff51dae131dd04388e4cff5267a6de81ce1f98c4f6a9cb9cc37e33dd305">GT_GRAPH</a>, <a class="code" href="Graph_8h.html#a520a09ff51dae131dd04388e4cff5267a7fb2b4bfd7da5bb2a6b32119043bb156">GT_COMPLEMENT</a> } <a class="code" href="Graph_8h.html#aa2142693629eb28bcfd13af8886f2786" title="the type of the graph">graphType</a>;</div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;</div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt; <span class="keyword">class </span><a class="code" href="classGraph.html">Graph</a>&lt;D&gt;;</div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;</div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00035"></a><span class="lineno"><a class="code" href="classDiGraph.html">   35</a></span>&#160;<span class="keyword">class </span><a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a> {</div>
<div class="line"><a name="l00036"></a><span class="lineno"><a class="code" href="classDiGraph.html#ac1e6e5a7b62a979f59e9fc9e1910576a">   36</a></span>&#160;        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classGraph.html">Graph</a>&lt;D&gt;;  </div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;</div>
<div class="line"><a name="l00038"></a><span class="lineno"><a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9">   38</a></span>&#160;        D ** <span class="keyword">const</span> <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>; </div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="keyword">protected</span>:</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div>
<div class="line"><a name="l00042"></a><span class="lineno"><a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122">   42</a></span>&#160;        <span class="keyword">const</span> <span class="keywordtype">long</span>      <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>;                                              </div>
<div class="line"><a name="l00043"></a><span class="lineno"><a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a">   43</a></span>&#160;        <span class="keywordtype">long</span>            <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a>;                                              </div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;</div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        <a class="code" href="classDiGraph.html#a45e6e3e72e747434366477b718d7cc19" title="A simple constructor.">DiGraph</a>(<span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>);</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html#a888342d25cf6d51149ad7bf267d1dcb2" title="The destructor.">~DiGraph</a>();</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#aa7b94dd44ea199c74447ceeb2df08db7" title="The number of vertices.">nverts</a>() <span class="keyword">const</span>;</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a374ae8d5e5503c00279089718b500bf5" title="Computes the number of edges.">countnedges</a>();</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a9ac2dec95165a6064d89c1356354ef26" title="Returns the number of edges.">nedges</a>() <span class="keyword">const</span>;</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#afd990277eb8013d42c7cc93186c63682" title="Adds an edge between the two specified vertices (optional operation).">addEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#a67b47751cfa02ac2905013e50836f822" title="Deletes the edge defined by the two specified vertices (optional operation).">delEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#a51ca0bc1dec757e005c28c3dcd1ab5c6" title="Swap the edge represented by the specified ordered pair (optional operation).">flipEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;</div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#a1e321ab267657ef4222b7b2954492e63" title="Adds all possible edges (optional operation).">addAllEdges</a>();</div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#adcf0b5b7a5745610dd50206672aec471" title="Removes all possible edges (optional operation).">delAllEdges</a>();</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;</div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classDiGraph.html#a37a974d4f6e7804c86feaf75a9837adb" title="Queries for an edge.">hasEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;</div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a33d282c4d5da07f660628b9672c1f67d" title="The number of neighbors of a specified vertex.">degree</a>(<span class="keywordtype">long</span> i) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;</div>
<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#aeb13a150a187caa0b77c347fbf14cd67" title="The number of anti-neighbors of a specified vertex.">antiDegree</a>(<span class="keywordtype">long</span> i) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;</div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;        <span class="keyword">virtual</span> <span class="keyword">const</span> D * <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(<span class="keywordtype">long</span> i) <span class="keyword">const</span> = 0;</div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;</div>
<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#ae50a20c8620a1e878470d40a102d622b" title="Joins the neighborhood of two specified vertices (optional operation).">joinAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;</div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#ac37f568249179469d947c7b327d6555c" title="Calculates the common neighborhood of specified vertices (optional operation)">commonAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;</div>
<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#ac0abfb4934659476b4273380d3bb2b8a" title="Removes from the neighborhood of one specified vertex the neighbors of a second specified vertex (opt...">diffAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;</div>
<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph&lt;D&gt;</a> * <a class="code" href="classDiGraph.html#aa78af5801fd24c325ce2d7058a7aca59" title="Create a clone of the current graph.">clone</a>() <span class="keyword">const</span> = 0;</div>
<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;</div>
<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph&lt;D&gt;</a> * <a class="code" href="classDiGraph.html#a63d6b74cf76002cefe0cfe4a342cb5a1" title="Create the square of the current graph.">square</a>() <span class="keyword">const</span>;</div>
<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;</div>
<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classDiGraph.html#ad28a15dffabbbb78b2e95a2276b06c43" title="Determine wherever or not the relation over the graph is empty.">isEmpty</a>();</div>
<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;</div>
<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;        <span class="comment">//DEBUG</span></div>
<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#ac1776e91b61ae0417cec6f44038a3ca6">show</a>();</div>
<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;};</div>
<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;</div>
<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00304"></a><span class="lineno"><a class="code" href="classDiGraph.html#a45e6e3e72e747434366477b718d7cc19">  304</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classDiGraph.html#a45e6e3e72e747434366477b718d7cc19" title="A simple constructor.">DiGraph&lt;D&gt;::DiGraph</a>(<span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>) : n(n), <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a>(0), <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>(new D *[n]) {</div>
<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;}</div>
<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;</div>
<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00308"></a><span class="lineno"><a class="code" href="classDiGraph.html#a888342d25cf6d51149ad7bf267d1dcb2">  308</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classDiGraph.html#a888342d25cf6d51149ad7bf267d1dcb2" title="The destructor.">DiGraph&lt;D&gt;::~DiGraph</a>() {</div>
<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>; i++)</div>
<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;                <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] != NULL)</div>
<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;                        <span class="keyword">delete</span> <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i];</div>
<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;        <span class="keyword">delete</span>[] <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>;</div>
<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;}</div>
<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;</div>
<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00316"></a><span class="lineno"><a class="code" href="classDiGraph.html#aa7b94dd44ea199c74447ceeb2df08db7">  316</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#aa7b94dd44ea199c74447ceeb2df08db7" title="The number of vertices.">DiGraph&lt;D&gt;::nverts</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>;</div>
<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;}</div>
<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;</div>
<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00321"></a><span class="lineno"><a class="code" href="classDiGraph.html#a9ac2dec95165a6064d89c1356354ef26">  321</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a9ac2dec95165a6064d89c1356354ef26" title="Returns the number of edges.">DiGraph&lt;D&gt;::nedges</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a>;</div>
<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;}</div>
<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;</div>
<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00326"></a><span class="lineno"><a class="code" href="classDiGraph.html#ae50a20c8620a1e878470d40a102d622b">  326</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#ae50a20c8620a1e878470d40a102d622b" title="Joins the neighborhood of two specified vertices (optional operation).">DiGraph&lt;D&gt;::joinAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[j] == NULL)</div>
<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[j] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(j);</div>
<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;        <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;addAll(<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[j]);</div>
<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;}</div>
<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;</div>
<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00335"></a><span class="lineno"><a class="code" href="classDiGraph.html#ac37f568249179469d947c7b327d6555c">  335</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#ac37f568249179469d947c7b327d6555c" title="Calculates the common neighborhood of specified vertices (optional operation)">DiGraph&lt;D&gt;::commonAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[j] == NULL)</div>
<div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[j] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(j);</div>
<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;        <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;retainAll(<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[j]);</div>
<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;}</div>
<div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;</div>
<div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00344"></a><span class="lineno"><a class="code" href="classDiGraph.html#ac0abfb4934659476b4273380d3bb2b8a">  344</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#ac0abfb4934659476b4273380d3bb2b8a" title="Removes from the neighborhood of one specified vertex the neighbors of a second specified vertex (opt...">DiGraph&lt;D&gt;::diffAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[j] == NULL)</div>
<div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[j] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(j);</div>
<div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;        <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;removeAll(<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[j]);</div>
<div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;}</div>
<div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;</div>
<div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00353"></a><span class="lineno"><a class="code" href="classDiGraph.html#a374ae8d5e5503c00279089718b500bf5">  353</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a374ae8d5e5503c00279089718b500bf5" title="Computes the number of edges.">DiGraph&lt;D&gt;::countnedges</a>() {</div>
<div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;        <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a> = 0;</div>
<div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>; i++) {</div>
<div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;                <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;                        <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;                <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a> += <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;cardOfSet();</div>
<div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;        }</div>
<div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a>;</div>
<div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;}</div>
<div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;</div>
<div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00364"></a><span class="lineno"><a class="code" href="classDiGraph.html#afd990277eb8013d42c7cc93186c63682">  364</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#afd990277eb8013d42c7cc93186c63682" title="Adds an edge between the two specified vertices (optional operation).">DiGraph&lt;D&gt;::addEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;        <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;toSet(j);</div>
<div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;}</div>
<div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;</div>
<div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00371"></a><span class="lineno"><a class="code" href="classDiGraph.html#a67b47751cfa02ac2905013e50836f822">  371</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#a67b47751cfa02ac2905013e50836f822" title="Deletes the edge defined by the two specified vertices (optional operation).">DiGraph&lt;D&gt;::delEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;        <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;toCompl(j);</div>
<div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;}</div>
<div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;</div>
<div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00378"></a><span class="lineno"><a class="code" href="classDiGraph.html#a51ca0bc1dec757e005c28c3dcd1ab5c6">  378</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#a51ca0bc1dec757e005c28c3dcd1ab5c6" title="Swap the edge represented by the specified ordered pair (optional operation).">DiGraph&lt;D&gt;::flipEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;flip(j);</div>
<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;}</div>
<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;</div>
<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00385"></a><span class="lineno"><a class="code" href="classDiGraph.html#a37a974d4f6e7804c86feaf75a9837adb">  385</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classDiGraph.html#a37a974d4f6e7804c86feaf75a9837adb" title="Queries for an edge.">DiGraph&lt;D&gt;::hasEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;isInSet(j);</div>
<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;}</div>
<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;</div>
<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00392"></a><span class="lineno"><a class="code" href="classDiGraph.html#a1e321ab267657ef4222b7b2954492e63">  392</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#a1e321ab267657ef4222b7b2954492e63" title="Adds all possible edges (optional operation).">DiGraph&lt;D&gt;::addAllEdges</a>() {</div>
<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>; i++) {</div>
<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;                <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;                        <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;allToSet();</div>
<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;        }</div>
<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;}</div>
<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;</div>
<div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00401"></a><span class="lineno"><a class="code" href="classDiGraph.html#adcf0b5b7a5745610dd50206672aec471">  401</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classDiGraph.html#adcf0b5b7a5745610dd50206672aec471" title="Removes all possible edges (optional operation).">DiGraph&lt;D&gt;::delAllEdges</a>() {</div>
<div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>; i++) {</div>
<div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;                <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;                        <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;allToCompl();</div>
<div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;        }</div>
<div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;}</div>
<div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;</div>
<div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00410"></a><span class="lineno"><a class="code" href="classDiGraph.html#a33d282c4d5da07f660628b9672c1f67d">  410</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a33d282c4d5da07f660628b9672c1f67d" title="The number of neighbors of a specified vertex.">DiGraph&lt;D&gt;::degree</a>(<span class="keywordtype">long</span> i)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;cardOfSet();</div>
<div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;}</div>
<div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;</div>
<div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00417"></a><span class="lineno"><a class="code" href="classDiGraph.html#aeb13a150a187caa0b77c347fbf14cd67">  417</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#aeb13a150a187caa0b77c347fbf14cd67" title="The number of anti-neighbors of a specified vertex.">DiGraph&lt;D&gt;::antiDegree</a>(<span class="keywordtype">long</span> i)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a> - <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;cardOfSet() - 1;</div>
<div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;}</div>
<div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;</div>
<div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00424"></a><span class="lineno"><a class="code" href="classDiGraph.html#a63d6b74cf76002cefe0cfe4a342cb5a1">  424</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a> * <a class="code" href="classDiGraph.html#a63d6b74cf76002cefe0cfe4a342cb5a1" title="Create the square of the current graph.">DiGraph&lt;D&gt;::square</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;        <span class="comment">//clone the current graph</span></div>
<div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;        <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a> * g = <a class="code" href="classDiGraph.html#aa78af5801fd24c325ce2d7058a7aca59" title="Create a clone of the current graph.">clone</a>();</div>
<div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;</div>
<div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;        <span class="comment">//add the transitive edges</span></div>
<div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>; i++) {</div>
<div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;                <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] == NULL)</div>
<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;                        <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;                <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a> * it = <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;newIterator();</div>
<div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;                <span class="keywordtype">long</span> iu = <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;universeSize();</div>
<div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;                <span class="keywordtype">long</span> j = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;                <span class="keywordflow">while</span> (j &lt; iu) {</div>
<div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;                        <span class="keywordflow">if</span> (<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[j] == NULL)</div>
<div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;                                <a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[j] = <a class="code" href="classDiGraph.html#a9abb77919af689dc43cb36ee5222786e" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(i);</div>
<div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;                        g-&gt;<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;addAll(<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[j]);</div>
<div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;                        it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;                }</div>
<div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;        }</div>
<div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;        <span class="keywordflow">return</span> g;</div>
<div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;}</div>
<div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;</div>
<div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00446"></a><span class="lineno"><a class="code" href="classBitMap.html">  446</a></span>&#160;<span class="keyword">class </span><a class="code" href="classBitMap.html">BitMap</a> {</div>
<div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;<span class="keyword">protected</span>:</div>
<div class="line"><a name="l00448"></a><span class="lineno"><a class="code" href="classBitMap.html#a5e9f7b287268b74d365ae767ae4bcf38">  448</a></span>&#160;        <span class="keywordtype">long</span> <span class="keywordtype">long</span>               <a class="code" href="classBitMap.html#a5e9f7b287268b74d365ae767ae4bcf38">matrixsize</a>;</div>
<div class="line"><a name="l00449"></a><span class="lineno"><a class="code" href="classBitMap.html#a607501eba66facb22e0daf43d7e579dd">  449</a></span>&#160;        <span class="keywordtype">int</span>                             <a class="code" href="classBitMap.html#a607501eba66facb22e0daf43d7e579dd">logrowsize</a>;</div>
<div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;</div>
<div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;        <a class="code" href="classBitMap.html#a949f66092fa327b30e1aaef2cf6f0347">BitMap</a>(<span class="keywordtype">long</span> n, <a class="code" href="classBitTools.html">BitTools&lt;T&gt;</a> * bt);</div>
<div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;        <span class="keywordtype">size_t</span> <a class="code" href="classBitMap.html#a3f136e92279172e1b92ebb2ea22de40c">rowIndex</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> i) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;        <span class="keywordtype">size_t</span> <a class="code" href="classBitMap.html#a6b91707e7bff726f83d7df4bff580844">pairIndex</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> i, <span class="keyword">const</span> <span class="keywordtype">int</span> j, <a class="code" href="classBitTools.html">BitTools&lt;T&gt;</a> * bt) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;};</div>
<div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;</div>
<div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00457"></a><span class="lineno"><a class="code" href="classBitMap.html#a949f66092fa327b30e1aaef2cf6f0347">  457</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMap.html#a949f66092fa327b30e1aaef2cf6f0347">BitMap&lt;T&gt;::BitMap</a>(<span class="keywordtype">long</span> n, <a class="code" href="classBitTools.html">BitTools&lt;T&gt;</a> * bt) {</div>
<div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;        logrowsize = bt-&gt;<a class="code" href="classBitTools.html#a5f8fe4c0a10ecf879b5a49453ebb5e77" title="Determine the ceil of the logarithmic of the specified value in the specified basis.">inline_ceillog</a>(n,2);</div>
<div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;        <span class="keywordflow">if</span> (logrowsize &lt; 0)</div>
<div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;                logrowsize = 0;</div>
<div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;        matrixsize = (1LL &lt;&lt; logrowsize)*n;</div>
<div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;}</div>
<div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;</div>
<div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00465"></a><span class="lineno"><a class="code" href="classBitMap.html#a3f136e92279172e1b92ebb2ea22de40c">  465</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">size_t</span> <a class="code" href="classBitMap.html#a3f136e92279172e1b92ebb2ea22de40c">BitMap&lt;T&gt;::rowIndex</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> i)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;        <span class="keywordflow">return</span> (i &lt;&lt; logrowsize);</div>
<div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;}</div>
<div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;</div>
<div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00470"></a><span class="lineno"><a class="code" href="classBitMap.html#a6b91707e7bff726f83d7df4bff580844">  470</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">size_t</span> <a class="code" href="classBitMap.html#a6b91707e7bff726f83d7df4bff580844">BitMap&lt;T&gt;::pairIndex</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> i, <span class="keyword">const</span> <span class="keywordtype">int</span> j, <a class="code" href="classBitTools.html">BitTools&lt;T&gt;</a> * bt)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;        <span class="keywordflow">return</span> rowIndex(i)+(j &gt;&gt; bt-&gt;<a class="code" href="classBitTools.html#a0fe1acc3156ee09ecd71da226484f638" title="logarithmic of the size, in bits, of a word">logb</a>);</div>
<div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;}</div>
<div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;</div>
<div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00475"></a><span class="lineno"><a class="code" href="classBitMapDiGraph.html">  475</a></span>&#160;<span class="keyword">class </span><a class="code" href="classBitMapDiGraph.html">BitMapDiGraph</a> : <span class="keyword">private</span> <a class="code" href="classBitMap.html">BitMap</a>&lt;T&gt;, <span class="keyword">protected</span> T, <span class="keyword">public</span> <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a> {</div>
<div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;</div>
<div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;        <a class="code" href="classBitMapDiGraph.html#a7746253c8eb6fe94313453175f502b5f">BitMapDiGraph</a>(<span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>);</div>
<div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classBitMapDiGraph.html#a325c5979ba9003792c524a94d47d2507">~BitMapDiGraph</a>();</div>
<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;</div>
<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;        <span class="keyword">virtual</span> <span class="keyword">const</span> T * <a class="code" href="classBitMapDiGraph.html#aae074918f7f2957eec7216f18b42476b" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(<span class="keywordtype">long</span> i) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * <a class="code" href="classBitMapDiGraph.html#a26cc16171db0a21a5f1d4d0c1bc4ed32" title="Create a clone of the current graph.">clone</a>() <span class="keyword">const</span>;</div>
<div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;</div>
<div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapDiGraph.html#a9b467074e0aad9e7aa8148cee539077d">nedges</a>();</div>
<div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapDiGraph.html#ab00a6b6d9cc920a5850ef1c9f71d7d08" title="Computes the number of edges.">countnedges</a>();</div>
<div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapDiGraph.html#a4d7f07667c3f2bdb8d54caf3c7ff80a4" title="Adds an edge between the two specified vertices (optional operation).">addEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapDiGraph.html#a51ee8382afd89facce0645c182f7ad5f" title="Deletes the edge defined by the two specified vertices (optional operation).">delEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapDiGraph.html#ac1ee1f14401f6f3ecfb566c7cf1905cf" title="Swap the edge represented by the specified ordered pair (optional operation).">flipEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapDiGraph.html#a69c90703a260e27c54345b9d1706583f" title="Adds all possible edges (optional operation).">addAllEdges</a>();</div>
<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapDiGraph.html#a46bdc8019056d94bd29f0f56ccd5bd6b" title="Removes all possible edges (optional operation).">delAllEdges</a>();</div>
<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classBitMapDiGraph.html#a97ae5a91a0f2b01f2fa1284c43045c23" title="Queries for an edge.">hasEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;</div>
<div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;};</div>
<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;</div>
<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00496"></a><span class="lineno"><a class="code" href="classBitMapDiGraph.html#a7746253c8eb6fe94313453175f502b5f">  496</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapDiGraph.html#a7746253c8eb6fe94313453175f502b5f">BitMapDiGraph&lt;T&gt;::BitMapDiGraph</a>(<span class="keywordtype">long</span> n) : <a class="code" href="classBitMap.html">BitMap</a>&lt;T&gt;(n,this), T(this-&gt;matrixsize), <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a>(n) {</div>
<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;</div>
<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;}</div>
<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;</div>
<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00501"></a><span class="lineno"><a class="code" href="classBitMapDiGraph.html#a325c5979ba9003792c524a94d47d2507">  501</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapDiGraph.html#a325c5979ba9003792c524a94d47d2507">BitMapDiGraph&lt;T&gt;::~BitMapDiGraph</a>() {</div>
<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;}</div>
<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;</div>
<div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00505"></a><span class="lineno"><a class="code" href="classBitMapDiGraph.html#aae074918f7f2957eec7216f18b42476b">  505</a></span>&#160;<span class="keyword">inline</span> <span class="keyword">const</span> T * <a class="code" href="classBitMapDiGraph.html#aae074918f7f2957eec7216f18b42476b" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">BitMapDiGraph&lt;T&gt;::neig</a>(<span class="keywordtype">long</span> i)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;        <span class="keywordflow">return</span> (<span class="keyword">const</span> T *) <span class="keyword">set</span>-&gt;subset(i &lt;&lt; this-&gt;logrowsize, i+(1LL &lt;&lt; this-&gt;logrowsize));</div>
<div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;}</div>
<div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;</div>
<div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00510"></a><span class="lineno"><a class="code" href="classBitMapDiGraph.html#a26cc16171db0a21a5f1d4d0c1bc4ed32">  510</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * <a class="code" href="classBitMapDiGraph.html#a26cc16171db0a21a5f1d4d0c1bc4ed32" title="Create a clone of the current graph.">BitMapDiGraph&lt;T&gt;::clone</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;        <span class="comment">//TODO</span></div>
<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;        <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a> * g = <span class="keyword">new</span> <a class="code" href="classBitMapDiGraph.html">BitMapDiGraph&lt;T&gt;</a>(n);</div>
<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;        <span class="keywordflow">return</span> g;</div>
<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;}</div>
<div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;</div>
<div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00517"></a><span class="lineno"><a class="code" href="classBitMapDiGraph.html#ab00a6b6d9cc920a5850ef1c9f71d7d08">  517</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapDiGraph.html#ab00a6b6d9cc920a5850ef1c9f71d7d08" title="Computes the number of edges.">BitMapDiGraph&lt;T&gt;::countnedges</a>() {</div>
<div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;        <span class="keywordflow">return</span> cardOfSet();</div>
<div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;}</div>
<div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;</div>
<div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00522"></a><span class="lineno"><a class="code" href="classBitMapDiGraph.html#a4d7f07667c3f2bdb8d54caf3c7ff80a4">  522</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapDiGraph.html#a4d7f07667c3f2bdb8d54caf3c7ff80a4" title="Adds an edge between the two specified vertices (optional operation).">BitMapDiGraph&lt;T&gt;::addEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;        toSet(pairIndex(i, j, <span class="keyword">this</span>));</div>
<div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;}</div>
<div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;</div>
<div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00527"></a><span class="lineno"><a class="code" href="classBitMapDiGraph.html#a51ee8382afd89facce0645c182f7ad5f">  527</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapDiGraph.html#a51ee8382afd89facce0645c182f7ad5f" title="Deletes the edge defined by the two specified vertices (optional operation).">BitMapDiGraph&lt;T&gt;::delEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;        toCompl(pairIndex(i, j, <span class="keyword">this</span>));</div>
<div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;}</div>
<div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;</div>
<div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00532"></a><span class="lineno"><a class="code" href="classBitMapDiGraph.html#ac1ee1f14401f6f3ecfb566c7cf1905cf">  532</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapDiGraph.html#ac1ee1f14401f6f3ecfb566c7cf1905cf" title="Swap the edge represented by the specified ordered pair (optional operation).">BitMapDiGraph&lt;T&gt;::flipEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;        <span class="keywordflow">return</span> flip(pairIndex(i, j, <span class="keyword">this</span>));</div>
<div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;}</div>
<div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;</div>
<div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00537"></a><span class="lineno"><a class="code" href="classBitMapDiGraph.html#a97ae5a91a0f2b01f2fa1284c43045c23">  537</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classBitMapDiGraph.html#a97ae5a91a0f2b01f2fa1284c43045c23" title="Queries for an edge.">BitMapDiGraph&lt;T&gt;::hasEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;        <span class="keywordflow">return</span> isInSet(pairIndex(i, j, <span class="keyword">this</span>));</div>
<div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;}</div>
<div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;</div>
<div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00542"></a><span class="lineno"><a class="code" href="classBitMapDiGraph.html#a69c90703a260e27c54345b9d1706583f">  542</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapDiGraph.html#a69c90703a260e27c54345b9d1706583f" title="Adds all possible edges (optional operation).">BitMapDiGraph&lt;T&gt;::addAllEdges</a>() {</div>
<div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;        allToSet();</div>
<div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;}</div>
<div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;</div>
<div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00547"></a><span class="lineno"><a class="code" href="classBitMapDiGraph.html#a46bdc8019056d94bd29f0f56ccd5bd6b">  547</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapDiGraph.html#a46bdc8019056d94bd29f0f56ccd5bd6b" title="Removes all possible edges (optional operation).">BitMapDiGraph&lt;T&gt;::delAllEdges</a>() {</div>
<div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;        allToCompl();</div>
<div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;}</div>
<div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;</div>
<div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00552"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html">  552</a></span>&#160;<span class="keyword">class </span><a class="code" href="classBitMapsDiGraph.html">BitMapsDiGraph</a> : <span class="keyword">public</span> <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a>&lt;T&gt; {</div>
<div class="line"><a name="l00553"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a20f5e51a7fcfcfcec4883821eda55b87">  553</a></span>&#160;        <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * <span class="keyword">const</span>      <a class="code" href="classBitMapsDiGraph.html#a20f5e51a7fcfcfcec4883821eda55b87">factory</a>;</div>
<div class="line"><a name="l00554"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#add939eff3fcb92708b74d2b564b6bd53">  554</a></span>&#160;        T ** <span class="keyword">const</span>                      <a class="code" href="classBitMapsDiGraph.html#add939eff3fcb92708b74d2b564b6bd53" title="The adjacent matrix of the graph.">adj</a>;            </div>
<div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;</div>
<div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;        <a class="code" href="classBitMapsDiGraph.html#ac28bdc24614557b55ea2b56831ffc2a2">BitMapsDiGraph</a>(T * <span class="keyword">set</span>);</div>
<div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;        <a class="code" href="classBitMapsDiGraph.html#ac28bdc24614557b55ea2b56831ffc2a2">BitMapsDiGraph</a>(<span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * <a class="code" href="classBitMapsDiGraph.html#a20f5e51a7fcfcfcec4883821eda55b87">factory</a>);</div>
<div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;        <a class="code" href="classBitMapsDiGraph.html#ac28bdc24614557b55ea2b56831ffc2a2">BitMapsDiGraph</a>(<span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * <a class="code" href="classBitMapsDiGraph.html#a20f5e51a7fcfcfcec4883821eda55b87">factory</a>, <span class="keywordtype">void</span> * handle);</div>
<div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;        <a class="code" href="classBitMapsDiGraph.html#ac28bdc24614557b55ea2b56831ffc2a2">BitMapsDiGraph</a>(<span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * <a class="code" href="classBitMapsDiGraph.html#a20f5e51a7fcfcfcec4883821eda55b87">factory</a>, <span class="keywordtype">void</span>** handle);</div>
<div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classBitMapsDiGraph.html#aa18d6d0e228a77b2d4fdba78d7a38451">~BitMapsDiGraph</a>();</div>
<div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;</div>
<div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;        <span class="keyword">virtual</span> <span class="keyword">const</span> T * <a class="code" href="classBitMapsDiGraph.html#acf8de5e20788d1f7df92a4d6367eda55" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(<span class="keywordtype">long</span> i) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * <a class="code" href="classBitMapsDiGraph.html#ac9ad54d9c2b29cc25f6b972d1114e354" title="Create a clone of the current graph.">clone</a>() <span class="keyword">const</span>;</div>
<div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;</div>
<div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsDiGraph.html#a907071207a723715653dcc45b3c1f463">nedges</a>();</div>
<div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#ab84d860c83d379d2ad5927d465b12580" title="Adds an edge between the two specified vertices (optional operation).">addEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#afe609857b9bbaebfa0ddad0902667518" title="Deletes the edge defined by the two specified vertices (optional operation).">delEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#a15e533c17e38382154d79b190b28878c" title="Swap the edge represented by the specified ordered pair (optional operation).">flipEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#a704d7f82a7394c0ea81aafccfad587ed" title="Adds all possible edges (optional operation).">addAllEdges</a>();</div>
<div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#a0ef685afce2f9868ce29b2a26aa456a1" title="Removes all possible edges (optional operation).">delAllEdges</a>();</div>
<div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classBitMapsDiGraph.html#a1284b25750f944fc0773cd0fdf6c3d59" title="Queries for an edge.">hasEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#a04d4f8f52f7a2e6714df98ac18f3f63f" title="Joins the neighborhood of two specified vertices (optional operation).">joinAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#a2fcbe6b2f4c2d82729a59f051ae81893" title="Calculates the common neighborhood of specified vertices (optional operation)">commonAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#a1f23b4e626cbb95eb079ccb36a985436" title="Removes from the neighborhood of one specified vertex the neighbors of a second specified vertex (opt...">diffAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsDiGraph.html#a7ba799d8a3ca6f465f08e0197577d201" title="Computes the number of edges.">countnedges</a>();</div>
<div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsDiGraph.html#a8e9cc1644130a3afd054838e6cac4cce" title="The number of neighbors of a specified vertex.">degree</a>(<span class="keywordtype">long</span> i) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsDiGraph.html#a8848ced1be63bf7f1b4d35dbcffac67d" title="The number of anti-neighbors of a specified vertex.">antiDegree</a>(<span class="keywordtype">long</span> i) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * <a class="code" href="classBitMapsDiGraph.html#a0e90a6f0523c3cc888beb11ee63776cd" title="Create the square of the current graph.">square</a>() <span class="keyword">const</span>;</div>
<div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;</div>
<div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;};</div>
<div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;</div>
<div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00584"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#ac28bdc24614557b55ea2b56831ffc2a2">  584</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapsDiGraph.html#ac28bdc24614557b55ea2b56831ffc2a2">BitMapsDiGraph&lt;T&gt;::BitMapsDiGraph</a>(T * <span class="keyword">set</span>) : <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a>&lt;T&gt;(set-&gt;universeSize()), factory(NULL), adj(new T*[n]) {</div>
<div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;        <span class="keywordtype">long</span> <span class="keywordtype">long</span> nn = <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>*<a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>;</div>
<div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; nn; i+=<a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>)</div>
<div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;                <a class="code" href="classBitMapsDiGraph.html#add939eff3fcb92708b74d2b564b6bd53" title="The adjacent matrix of the graph.">adj</a>[i] = (T *) <span class="keyword">set</span>-&gt;subset(i, i+n);</div>
<div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;        <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a> = <a class="code" href="classBitMapsDiGraph.html#a7ba799d8a3ca6f465f08e0197577d201" title="Computes the number of edges.">countnedges</a>();</div>
<div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;}</div>
<div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;</div>
<div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00592"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#ac0a1e45ad5284d3d956a3bf841946e63">  592</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapsDiGraph.html#ac28bdc24614557b55ea2b56831ffc2a2">BitMapsDiGraph&lt;T&gt;::BitMapsDiGraph</a>(<span class="keywordtype">long</span> n, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory) : <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a>&lt;T&gt;(n), factory(factory), adj(new T*[n]) {</div>
<div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>; i++)</div>
<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;                <a class="code" href="classBitMapsDiGraph.html#add939eff3fcb92708b74d2b564b6bd53" title="The adjacent matrix of the graph.">adj</a>[i] = (T *) factory-&gt;<a class="code" href="classFactory.html#a0ed0b3527539a0631d8147d8aa94b75a">newInstance</a>(n);</div>
<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;        <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a> = 0;</div>
<div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;}</div>
<div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;</div>
<div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00599"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#ab97027cabbb0d1c8521771ba8819dd2e">  599</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapsDiGraph.html#ac28bdc24614557b55ea2b56831ffc2a2">BitMapsDiGraph&lt;T&gt;::BitMapsDiGraph</a>(<span class="keywordtype">long</span> n, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">void</span> * handle) : <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a>&lt;T&gt;(n), factory(factory), adj(new T*[n]) {</div>
<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>; i++)</div>
<div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;                <a class="code" href="classBitMapsDiGraph.html#add939eff3fcb92708b74d2b564b6bd53" title="The adjacent matrix of the graph.">adj</a>[i] = (T *) factory-&gt;<a class="code" href="classFactory.html#a0ed0b3527539a0631d8147d8aa94b75a">newInstance</a>(n, handle);</div>
<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;        <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a> = <a class="code" href="classBitMapsDiGraph.html#a7ba799d8a3ca6f465f08e0197577d201" title="Computes the number of edges.">countnedges</a>();</div>
<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;}</div>
<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;</div>
<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00606"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a855d281fa688fe01541a6475d3440631">  606</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapsDiGraph.html#ac28bdc24614557b55ea2b56831ffc2a2">BitMapsDiGraph&lt;T&gt;::BitMapsDiGraph</a>(<span class="keywordtype">long</span> n, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">void</span>** handle) : <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a>(n), factory(factory), adj(new T*[n]) {</div>
<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>; i++)</div>
<div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;                <a class="code" href="classBitMapsDiGraph.html#add939eff3fcb92708b74d2b564b6bd53" title="The adjacent matrix of the graph.">adj</a>[i] = (T *) factory-&gt;<a class="code" href="classFactory.html#a0ed0b3527539a0631d8147d8aa94b75a">newInstance</a>(n, handle[i]);</div>
<div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;        <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a> = <a class="code" href="classBitMapsDiGraph.html#a7ba799d8a3ca6f465f08e0197577d201" title="Computes the number of edges.">countnedges</a>();</div>
<div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;}</div>
<div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;</div>
<div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00613"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#aa18d6d0e228a77b2d4fdba78d7a38451">  613</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapsDiGraph.html#aa18d6d0e228a77b2d4fdba78d7a38451">BitMapsDiGraph&lt;T&gt;::~BitMapsDiGraph</a>() {</div>
<div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; n; i++)</div>
<div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;                <span class="keyword">delete</span> adj[i];</div>
<div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;        <span class="keyword">delete</span>[] adj;</div>
<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;}</div>
<div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;</div>
<div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00620"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#acf8de5e20788d1f7df92a4d6367eda55">  620</a></span>&#160;<span class="keyword">inline</span> <span class="keyword">const</span> T * <a class="code" href="classBitMapsDiGraph.html#acf8de5e20788d1f7df92a4d6367eda55" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">BitMapsDiGraph&lt;T&gt;::neig</a>(<span class="keywordtype">long</span> i)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;        <span class="keywordflow">return</span> (<span class="keyword">const</span> T *) adj[i]-&gt;subset(0, adj[i]-&gt;universeSize());</div>
<div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;}</div>
<div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;</div>
<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00625"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#ac9ad54d9c2b29cc25f6b972d1114e354">  625</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * <a class="code" href="classBitMapsDiGraph.html#ac9ad54d9c2b29cc25f6b972d1114e354" title="Create a clone of the current graph.">BitMapsDiGraph&lt;T&gt;::clone</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;        <span class="comment">//TODO</span></div>
<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;        <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a> * g = <span class="keyword">new</span> <a class="code" href="classBitMapDiGraph.html">BitMapDiGraph&lt;T&gt;</a>(n);</div>
<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;        <span class="keywordflow">return</span> g;</div>
<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;}</div>
<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;</div>
<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00632"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a04d4f8f52f7a2e6714df98ac18f3f63f">  632</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#a04d4f8f52f7a2e6714df98ac18f3f63f" title="Joins the neighborhood of two specified vertices (optional operation).">BitMapsDiGraph&lt;T&gt;::joinAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;        adj[i]-&gt;addAll(adj[j]);</div>
<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;}</div>
<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;</div>
<div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00637"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a2fcbe6b2f4c2d82729a59f051ae81893">  637</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#a2fcbe6b2f4c2d82729a59f051ae81893" title="Calculates the common neighborhood of specified vertices (optional operation)">BitMapsDiGraph&lt;T&gt;::commonAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;        adj[i]-&gt;retainAll(adj[j]);</div>
<div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;}</div>
<div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;</div>
<div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00642"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a1f23b4e626cbb95eb079ccb36a985436">  642</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#a1f23b4e626cbb95eb079ccb36a985436" title="Removes from the neighborhood of one specified vertex the neighbors of a second specified vertex (opt...">BitMapsDiGraph&lt;T&gt;::diffAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;        adj[i]-&gt;removeAll(adj[j]);</div>
<div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;}</div>
<div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;</div>
<div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00647"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a7ba799d8a3ca6f465f08e0197577d201">  647</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsDiGraph.html#a7ba799d8a3ca6f465f08e0197577d201" title="Computes the number of edges.">BitMapsDiGraph&lt;T&gt;::countnedges</a>() {</div>
<div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;        m = 0;</div>
<div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; n; i++)</div>
<div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;                m += adj[i]-&gt;cardOfSet();</div>
<div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;        <span class="keywordflow">return</span> m;</div>
<div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;}</div>
<div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;</div>
<div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00655"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#ab84d860c83d379d2ad5927d465b12580">  655</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#ab84d860c83d379d2ad5927d465b12580" title="Adds an edge between the two specified vertices (optional operation).">BitMapsDiGraph&lt;T&gt;::addEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;        adj[i]-&gt;toSet(j);</div>
<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;}</div>
<div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;</div>
<div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00660"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#afe609857b9bbaebfa0ddad0902667518">  660</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#afe609857b9bbaebfa0ddad0902667518" title="Deletes the edge defined by the two specified vertices (optional operation).">BitMapsDiGraph&lt;T&gt;::delEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;        adj[i]-&gt;toCompl(j);</div>
<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;}</div>
<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;</div>
<div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00665"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a15e533c17e38382154d79b190b28878c">  665</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#a15e533c17e38382154d79b190b28878c" title="Swap the edge represented by the specified ordered pair (optional operation).">BitMapsDiGraph&lt;T&gt;::flipEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;        adj[i]-&gt;flip(j);</div>
<div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;}</div>
<div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;</div>
<div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00670"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a1284b25750f944fc0773cd0fdf6c3d59">  670</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classBitMapsDiGraph.html#a1284b25750f944fc0773cd0fdf6c3d59" title="Queries for an edge.">BitMapsDiGraph&lt;T&gt;::hasEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;        <span class="keywordflow">return</span> adj[i]-&gt;isInSet(j);</div>
<div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;}</div>
<div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160;</div>
<div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00675"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a704d7f82a7394c0ea81aafccfad587ed">  675</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#a704d7f82a7394c0ea81aafccfad587ed" title="Adds all possible edges (optional operation).">BitMapsDiGraph&lt;T&gt;::addAllEdges</a>() {</div>
<div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; n; i++)</div>
<div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;                adj[i]-&gt;allToSet();</div>
<div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;}</div>
<div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;</div>
<div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00681"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a0ef685afce2f9868ce29b2a26aa456a1">  681</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsDiGraph.html#a0ef685afce2f9868ce29b2a26aa456a1" title="Removes all possible edges (optional operation).">BitMapsDiGraph&lt;T&gt;::delAllEdges</a>() {</div>
<div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; n; i++)</div>
<div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;                adj[i]-&gt;allToCompl();</div>
<div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;}</div>
<div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160;</div>
<div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00687"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a8e9cc1644130a3afd054838e6cac4cce">  687</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsDiGraph.html#a8e9cc1644130a3afd054838e6cac4cce" title="The number of neighbors of a specified vertex.">BitMapsDiGraph&lt;T&gt;::degree</a>(<span class="keywordtype">long</span> i)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;        <span class="keywordflow">return</span> adj[i]-&gt;cardOfSet();</div>
<div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;}</div>
<div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;</div>
<div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00692"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a8848ced1be63bf7f1b4d35dbcffac67d">  692</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsDiGraph.html#a8848ced1be63bf7f1b4d35dbcffac67d" title="The number of anti-neighbors of a specified vertex.">BitMapsDiGraph&lt;T&gt;::antiDegree</a>(<span class="keywordtype">long</span> i)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;        <span class="keywordflow">return</span> n - adj[i]-&gt;cardOfSet() - 1;</div>
<div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;}</div>
<div class="line"><a name="l00695"></a><span class="lineno">  695</span>&#160;</div>
<div class="line"><a name="l00696"></a><span class="lineno">  696</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00697"></a><span class="lineno"><a class="code" href="classBitMapsDiGraph.html#a0e90a6f0523c3cc888beb11ee63776cd">  697</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * <a class="code" href="classBitMapsDiGraph.html#a0e90a6f0523c3cc888beb11ee63776cd" title="Create the square of the current graph.">BitMapsDiGraph&lt;T&gt;::square</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160;        <span class="comment">//clone the current graph</span></div>
<div class="line"><a name="l00699"></a><span class="lineno">  699</span>&#160;        <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * g = clone();</div>
<div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;</div>
<div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;        <span class="comment">//add the transitive edges</span></div>
<div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;                <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a> * it = adj[i]-&gt;newIterator();</div>
<div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160;                <span class="keywordtype">long</span> iu = adj[i]-&gt;universeSize();</div>
<div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;                <span class="keywordtype">long</span> j = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;                <span class="keywordflow">while</span> (j &lt; iu) {</div>
<div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160;                        g-&gt;<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;addAll(adj[j]);</div>
<div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;                        it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;                }</div>
<div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;        }</div>
<div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160;        <span class="keywordflow">return</span> g;</div>
<div class="line"><a name="l00712"></a><span class="lineno">  712</span>&#160;}</div>
<div class="line"><a name="l00713"></a><span class="lineno">  713</span>&#160;</div>
<div class="line"><a name="l00717"></a><span class="lineno">  717</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00718"></a><span class="lineno"><a class="code" href="classGraph.html">  718</a></span>&#160;<span class="keyword">class </span><a class="code" href="classGraph.html">Graph</a> : <span class="keyword">public</span> <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a>&lt;D&gt; {</div>
<div class="line"><a name="l00719"></a><span class="lineno"><a class="code" href="classGraph.html#a42783725efe6469a559aaf293927fd03">  719</a></span>&#160;        <a class="code" href="classGraph.html#a42783725efe6469a559aaf293927fd03">Graph</a>(<span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>) : <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a>&lt;D&gt;(n) {};</div>
<div class="line"><a name="l00720"></a><span class="lineno">  720</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classGraph.html#a40d32250cafa5d5e17b9fa6c8e802272">~Graph</a>();</div>
<div class="line"><a name="l00721"></a><span class="lineno">  721</span>&#160;</div>
<div class="line"><a name="l00734"></a><span class="lineno">  734</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classGraph.html#a60727c0e122156a7f70019795a6aade3" title="Adds an edge between the two specified vertices (optional operation).">addEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;</div>
<div class="line"><a name="l00749"></a><span class="lineno">  749</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classGraph.html#aec1d47825b39b88d7368330cd1e12497" title="Deletes the edge defined by the two specified vertices (optional operation).">delEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00750"></a><span class="lineno">  750</span>&#160;</div>
<div class="line"><a name="l00761"></a><span class="lineno">  761</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classGraph.html#a33bc7b325cc386e33577873f22cae843" title="Swap the edge represented by the specified ordered pair (optional operation).">flipEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00762"></a><span class="lineno">  762</span>&#160;</div>
<div class="line"><a name="l00763"></a><span class="lineno">  763</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classGraph.html#aa48d8578b691867f2f9ea9a06f0379d4" title="Joins the neighborhood of two specified vertices (optional operation).">joinAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00764"></a><span class="lineno">  764</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classGraph.html#ad8f1be542121d900ce4a6714fc4790c7" title="Calculates the common neighborhood of specified vertices (optional operation)">commonAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00765"></a><span class="lineno">  765</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classGraph.html#a44bb6e4984060e2ec712521973916bfa" title="Removes from the neighborhood of one specified vertex the neighbors of a second specified vertex (opt...">diffAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00766"></a><span class="lineno">  766</span>&#160;</div>
<div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a> * <a class="code" href="classGraph.html#aa8af5d1b51a06458e6b369b2d017fb9a" title="Creates a homomorphism of the current graph.">homomorphism</a>(<span class="keywordtype">long</span> rsize, <span class="keywordtype">char</span> * R);</div>
<div class="line"><a name="l00787"></a><span class="lineno">  787</span>&#160;</div>
<div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a> * <a class="code" href="classGraph.html#a6e6876cdbda5025eb6e0ded963f4ab15" title="The complement of the current graph.">complement</a>();</div>
<div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;};</div>
<div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;</div>
<div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00802"></a><span class="lineno"><a class="code" href="classGraph.html#a60727c0e122156a7f70019795a6aade3">  802</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classGraph.html#a60727c0e122156a7f70019795a6aade3" title="Adds an edge between the two specified vertices (optional operation).">Graph&lt;D&gt;::addEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;        <a class="code" href="classDiGraph.html#afd990277eb8013d42c7cc93186c63682" title="Adds an edge between the two specified vertices (optional operation).">DiGraph&lt;D&gt;::addEdge</a>(i, j);</div>
<div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;        <a class="code" href="classDiGraph.html#afd990277eb8013d42c7cc93186c63682" title="Adds an edge between the two specified vertices (optional operation).">DiGraph&lt;D&gt;::addEdge</a>(j, i);</div>
<div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;}</div>
<div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;</div>
<div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00808"></a><span class="lineno"><a class="code" href="classGraph.html#aec1d47825b39b88d7368330cd1e12497">  808</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classGraph.html#aec1d47825b39b88d7368330cd1e12497" title="Deletes the edge defined by the two specified vertices (optional operation).">Graph&lt;D&gt;::delEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;        <a class="code" href="classDiGraph.html#a67b47751cfa02ac2905013e50836f822" title="Deletes the edge defined by the two specified vertices (optional operation).">DiGraph&lt;D&gt;::delEdge</a>(i, j);</div>
<div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;        <a class="code" href="classDiGraph.html#a67b47751cfa02ac2905013e50836f822" title="Deletes the edge defined by the two specified vertices (optional operation).">DiGraph&lt;D&gt;::delEdge</a>(j, i);</div>
<div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;}</div>
<div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;</div>
<div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00814"></a><span class="lineno"><a class="code" href="classGraph.html#a33bc7b325cc386e33577873f22cae843">  814</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classGraph.html#a33bc7b325cc386e33577873f22cae843" title="Swap the edge represented by the specified ordered pair (optional operation).">Graph&lt;D&gt;::flipEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00815"></a><span class="lineno">  815</span>&#160;        <a class="code" href="classDiGraph.html#a51ca0bc1dec757e005c28c3dcd1ab5c6" title="Swap the edge represented by the specified ordered pair (optional operation).">DiGraph&lt;D&gt;::flipEdge</a>(i, j);</div>
<div class="line"><a name="l00816"></a><span class="lineno">  816</span>&#160;        <a class="code" href="classDiGraph.html#a51ca0bc1dec757e005c28c3dcd1ab5c6" title="Swap the edge represented by the specified ordered pair (optional operation).">DiGraph&lt;D&gt;::flipEdge</a>(j, i);</div>
<div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160;}</div>
<div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;</div>
<div class="line"><a name="l00819"></a><span class="lineno">  819</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00820"></a><span class="lineno"><a class="code" href="classGraph.html#aa48d8578b691867f2f9ea9a06f0379d4">  820</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classGraph.html#aa48d8578b691867f2f9ea9a06f0379d4" title="Joins the neighborhood of two specified vertices (optional operation).">Graph&lt;D&gt;::joinAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160;        <a class="code" href="classDiGraph.html#ae50a20c8620a1e878470d40a102d622b" title="Joins the neighborhood of two specified vertices (optional operation).">DiGraph&lt;D&gt;::joinAdj</a>(i, j); <span class="comment">// this call assures that adj[j] != NULL</span></div>
<div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;</div>
<div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a> * it = adj[j]-&gt;newIterator();</div>
<div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;        <span class="keywordtype">long</span> l = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;        <span class="keywordtype">long</span> iu = adj[j]-&gt;universeSize();</div>
<div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;        <span class="keywordflow">while</span> (l &lt; iu) {</div>
<div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;                <a class="code" href="classDiGraph.html#afd990277eb8013d42c7cc93186c63682" title="Adds an edge between the two specified vertices (optional operation).">DiGraph&lt;D&gt;::addEdge</a>(l, i);</div>
<div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;                it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;        }</div>
<div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;}</div>
<div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;</div>
<div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00833"></a><span class="lineno"><a class="code" href="classGraph.html#ad8f1be542121d900ce4a6714fc4790c7">  833</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classGraph.html#ad8f1be542121d900ce4a6714fc4790c7" title="Calculates the common neighborhood of specified vertices (optional operation)">Graph&lt;D&gt;::commonAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;        <a class="code" href="classDiGraph.html#ac37f568249179469d947c7b327d6555c" title="Calculates the common neighborhood of specified vertices (optional operation)">DiGraph&lt;D&gt;::commonAdj</a>(i, j); <span class="comment">// this call assures that adj[j] != NULL</span></div>
<div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;</div>
<div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a> * it = adj[i]-&gt;newComplIterator();</div>
<div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;        <span class="keywordtype">long</span> l = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;        <span class="keywordtype">long</span> iu = adj[i]-&gt;universeSize();</div>
<div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;        <span class="keywordflow">while</span> (l &lt; iu) {</div>
<div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;                <a class="code" href="classDiGraph.html#a67b47751cfa02ac2905013e50836f822" title="Deletes the edge defined by the two specified vertices (optional operation).">DiGraph&lt;D&gt;::delEdge</a>(l, i);</div>
<div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;                it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;        }</div>
<div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;}</div>
<div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;</div>
<div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l00846"></a><span class="lineno"><a class="code" href="classGraph.html#a44bb6e4984060e2ec712521973916bfa">  846</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classGraph.html#a44bb6e4984060e2ec712521973916bfa" title="Removes from the neighborhood of one specified vertex the neighbors of a second specified vertex (opt...">Graph&lt;D&gt;::diffAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;        <a class="code" href="classDiGraph.html#ac0abfb4934659476b4273380d3bb2b8a" title="Removes from the neighborhood of one specified vertex the neighbors of a second specified vertex (opt...">DiGraph&lt;D&gt;::diffAdj</a>(i, j); <span class="comment">// this call assures that adj[j] != NULL</span></div>
<div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;</div>
<div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a> * it = adj[i]-&gt;newComplIterator();</div>
<div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;        <span class="keywordtype">long</span> l = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;        <span class="keywordtype">long</span> iu = adj[i]-&gt;universeSize();</div>
<div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;        <span class="keywordflow">while</span> (l &lt; iu) {</div>
<div class="line"><a name="l00853"></a><span class="lineno">  853</span>&#160;                <a class="code" href="classDiGraph.html#a67b47751cfa02ac2905013e50836f822" title="Deletes the edge defined by the two specified vertices (optional operation).">DiGraph&lt;D&gt;::delEdge</a>(l, i);</div>
<div class="line"><a name="l00854"></a><span class="lineno">  854</span>&#160;                it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l00855"></a><span class="lineno">  855</span>&#160;        }</div>
<div class="line"><a name="l00856"></a><span class="lineno">  856</span>&#160;}</div>
<div class="line"><a name="l00857"></a><span class="lineno">  857</span>&#160;</div>
<div class="line"><a name="l00858"></a><span class="lineno">  858</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00859"></a><span class="lineno"><a class="code" href="classBitMapGraph.html">  859</a></span>&#160;<span class="keyword">class </span><a class="code" href="classBitMapGraph.html">BitMapGraph</a> : <span class="keyword">private</span> <a class="code" href="classBitMap.html">BitMap</a>&lt;T&gt;, <span class="keyword">protected</span> T, <span class="keyword">public</span> <a class="code" href="classGraph.html">Graph</a> {</div>
<div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;</div>
<div class="line"><a name="l00861"></a><span class="lineno">  861</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;        <a class="code" href="classBitMapGraph.html#a96b9c95b12979b13827ad15f24952277">BitMapGraph</a>(<span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>);</div>
<div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classBitMapGraph.html#ab6c46a28b3c0e0614411566e694f2a58">~BitMapGraph</a>();</div>
<div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;</div>
<div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;        <span class="keyword">virtual</span> <span class="keyword">const</span> T * <a class="code" href="classBitMapGraph.html#af8389e365b349cdf785e771f3567a7ed" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(<span class="keywordtype">long</span> i) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * <a class="code" href="classBitMapGraph.html#ad29509bccfb57f095b572c43aa84981d" title="Create a clone of the current graph.">clone</a>() <span class="keyword">const</span>;</div>
<div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;</div>
<div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapGraph.html#a199d0aa1a2fe63f15c38bd22e9ac9b7c">nedges</a>();</div>
<div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapGraph.html#a8139a427f5d2b1efb809a3b35bf934cc" title="Computes the number of edges.">countnedges</a>();</div>
<div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapGraph.html#a7172dd247d28ec94509bee45d2d4b1d7" title="Adds an edge between the two specified vertices (optional operation).">addEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapGraph.html#acb69e0ac1a827ab13da5e4b18653f5bd" title="Deletes the edge defined by the two specified vertices (optional operation).">delEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapGraph.html#a94d0f8b55c78a2d68cafef5afde9e5b0" title="Swap the edge represented by the specified ordered pair (optional operation).">flipEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00873"></a><span class="lineno">  873</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapGraph.html#acb92c335f7ece7a54614b3add8a30e82" title="Adds all possible edges (optional operation).">addAllEdges</a>();</div>
<div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapGraph.html#a9034712840977c440a925c84d06ecb57" title="Removes all possible edges (optional operation).">delAllEdges</a>();</div>
<div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classBitMapGraph.html#ab3bca9eb211a807508581226fc9a39ee" title="Queries for an edge.">hasEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00876"></a><span class="lineno">  876</span>&#160;</div>
<div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;};</div>
<div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;</div>
<div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00880"></a><span class="lineno"><a class="code" href="classBitMapGraph.html#a96b9c95b12979b13827ad15f24952277">  880</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapGraph.html#a96b9c95b12979b13827ad15f24952277">BitMapGraph&lt;T&gt;::BitMapGraph</a>(<span class="keywordtype">long</span> n) : <a class="code" href="classBitMap.html">BitMap</a>&lt;T&gt;(n,this), T(this-&gt;matrixsize), <a class="code" href="classGraph.html">Graph</a>(n) {</div>
<div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;</div>
<div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;}</div>
<div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;</div>
<div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00885"></a><span class="lineno"><a class="code" href="classBitMapGraph.html#ab6c46a28b3c0e0614411566e694f2a58">  885</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapGraph.html#ab6c46a28b3c0e0614411566e694f2a58">BitMapGraph&lt;T&gt;::~BitMapGraph</a>() {</div>
<div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;}</div>
<div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;</div>
<div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00889"></a><span class="lineno"><a class="code" href="classBitMapGraph.html#af8389e365b349cdf785e771f3567a7ed">  889</a></span>&#160;<span class="keyword">inline</span> <span class="keyword">const</span> T * <a class="code" href="classBitMapGraph.html#af8389e365b349cdf785e771f3567a7ed" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">BitMapGraph&lt;T&gt;::neig</a>(<span class="keywordtype">long</span> i)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160;        <span class="keywordflow">return</span> (<span class="keyword">const</span> T *) <span class="keyword">set</span>-&gt;subset(i &lt;&lt; this-&gt;logrowsize, i+(1LL &lt;&lt; this-&gt;logrowsize));</div>
<div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;}</div>
<div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;</div>
<div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00894"></a><span class="lineno"><a class="code" href="classBitMapGraph.html#ad29509bccfb57f095b572c43aa84981d">  894</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * <a class="code" href="classBitMapGraph.html#ad29509bccfb57f095b572c43aa84981d" title="Create a clone of the current graph.">BitMapGraph&lt;T&gt;::clone</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160;        <span class="comment">//TODO</span></div>
<div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;        <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * g = <span class="keyword">new</span> <a class="code" href="classBitMapDiGraph.html">BitMapDiGraph&lt;T&gt;</a>(n);</div>
<div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;        <span class="keywordflow">return</span> g;</div>
<div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;}</div>
<div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;</div>
<div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00901"></a><span class="lineno"><a class="code" href="classBitMapGraph.html#a8139a427f5d2b1efb809a3b35bf934cc">  901</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapGraph.html#a8139a427f5d2b1efb809a3b35bf934cc" title="Computes the number of edges.">BitMapGraph&lt;T&gt;::countnedges</a>() {</div>
<div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;        <span class="keywordflow">return</span> cardOfSet();</div>
<div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;}</div>
<div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;</div>
<div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00906"></a><span class="lineno"><a class="code" href="classBitMapGraph.html#a7172dd247d28ec94509bee45d2d4b1d7">  906</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapGraph.html#a7172dd247d28ec94509bee45d2d4b1d7" title="Adds an edge between the two specified vertices (optional operation).">BitMapGraph&lt;T&gt;::addEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;        toSet(pairIndex(i, j, <span class="keyword">this</span>));</div>
<div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;        toSet(pairIndex(j, i, <span class="keyword">this</span>));</div>
<div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160;}</div>
<div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;</div>
<div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00912"></a><span class="lineno"><a class="code" href="classBitMapGraph.html#acb69e0ac1a827ab13da5e4b18653f5bd">  912</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapGraph.html#acb69e0ac1a827ab13da5e4b18653f5bd" title="Deletes the edge defined by the two specified vertices (optional operation).">BitMapGraph&lt;T&gt;::delEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160;        toCompl(pairIndex(i, j, <span class="keyword">this</span>));</div>
<div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160;        toCompl(pairIndex(j, i, <span class="keyword">this</span>));</div>
<div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;}</div>
<div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160;</div>
<div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00918"></a><span class="lineno"><a class="code" href="classBitMapGraph.html#a94d0f8b55c78a2d68cafef5afde9e5b0">  918</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapGraph.html#a94d0f8b55c78a2d68cafef5afde9e5b0" title="Swap the edge represented by the specified ordered pair (optional operation).">BitMapGraph&lt;T&gt;::flipEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;        flip(pairIndex(i, j, <span class="keyword">this</span>));</div>
<div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;        flip(pairIndex(j, i, <span class="keyword">this</span>));</div>
<div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;}</div>
<div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;</div>
<div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00924"></a><span class="lineno"><a class="code" href="classBitMapGraph.html#ab3bca9eb211a807508581226fc9a39ee">  924</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classBitMapGraph.html#ab3bca9eb211a807508581226fc9a39ee" title="Queries for an edge.">BitMapGraph&lt;T&gt;::hasEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00925"></a><span class="lineno">  925</span>&#160;        <span class="keywordflow">return</span> isInSet(pairIndex(i, j, <span class="keyword">this</span>));</div>
<div class="line"><a name="l00926"></a><span class="lineno">  926</span>&#160;}</div>
<div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;</div>
<div class="line"><a name="l00928"></a><span class="lineno">  928</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00929"></a><span class="lineno"><a class="code" href="classBitMapGraph.html#acb92c335f7ece7a54614b3add8a30e82">  929</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapGraph.html#acb92c335f7ece7a54614b3add8a30e82" title="Adds all possible edges (optional operation).">BitMapGraph&lt;T&gt;::addAllEdges</a>() {</div>
<div class="line"><a name="l00930"></a><span class="lineno">  930</span>&#160;        allToSet();</div>
<div class="line"><a name="l00931"></a><span class="lineno">  931</span>&#160;}</div>
<div class="line"><a name="l00932"></a><span class="lineno">  932</span>&#160;</div>
<div class="line"><a name="l00933"></a><span class="lineno">  933</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00934"></a><span class="lineno"><a class="code" href="classBitMapGraph.html#a9034712840977c440a925c84d06ecb57">  934</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapGraph.html#a9034712840977c440a925c84d06ecb57" title="Removes all possible edges (optional operation).">BitMapGraph&lt;T&gt;::delAllEdges</a>() {</div>
<div class="line"><a name="l00935"></a><span class="lineno">  935</span>&#160;        allToCompl();</div>
<div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;}</div>
<div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;</div>
<div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00939"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html">  939</a></span>&#160;<span class="keyword">class </span><a class="code" href="classBitMapsGraph.html">BitMapsGraph</a> : <span class="keyword">public</span> <a class="code" href="classGraph.html">Graph</a>&lt;T&gt; {</div>
<div class="line"><a name="l00940"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#a569a5bb57d1eee6fbff7004536dfe0d1">  940</a></span>&#160;        <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * <span class="keyword">const</span>      <a class="code" href="classBitMapsGraph.html#a569a5bb57d1eee6fbff7004536dfe0d1">factory</a>;</div>
<div class="line"><a name="l00941"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#ab6c15b269fb996d001857cd7354138f2">  941</a></span>&#160;        T ** <span class="keyword">const</span>                      <a class="code" href="classBitMapsGraph.html#ab6c15b269fb996d001857cd7354138f2" title="The adjacent matrix of the graph.">adj</a>;            </div>
<div class="line"><a name="l00942"></a><span class="lineno">  942</span>&#160;</div>
<div class="line"><a name="l00943"></a><span class="lineno">  943</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00944"></a><span class="lineno">  944</span>&#160;        <a class="code" href="classBitMapsGraph.html#a8593a9905142dd840900e5028d992706">BitMapsGraph</a>(T * <span class="keyword">set</span>);</div>
<div class="line"><a name="l00945"></a><span class="lineno">  945</span>&#160;        <a class="code" href="classBitMapsGraph.html#a8593a9905142dd840900e5028d992706">BitMapsGraph</a>(<span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * <a class="code" href="classBitMapsGraph.html#a569a5bb57d1eee6fbff7004536dfe0d1">factory</a>);</div>
<div class="line"><a name="l00946"></a><span class="lineno">  946</span>&#160;        <a class="code" href="classBitMapsGraph.html#a8593a9905142dd840900e5028d992706">BitMapsGraph</a>(<span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * <a class="code" href="classBitMapsGraph.html#a569a5bb57d1eee6fbff7004536dfe0d1">factory</a>, <span class="keywordtype">void</span> * handle);</div>
<div class="line"><a name="l00947"></a><span class="lineno">  947</span>&#160;        <a class="code" href="classBitMapsGraph.html#a8593a9905142dd840900e5028d992706">BitMapsGraph</a>(<span class="keywordtype">long</span> <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * <a class="code" href="classBitMapsGraph.html#a569a5bb57d1eee6fbff7004536dfe0d1">factory</a>, <span class="keywordtype">void</span>** handle);</div>
<div class="line"><a name="l00948"></a><span class="lineno">  948</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classBitMapsGraph.html#a85623f92cd881b813487e7af31b98ed7">~BitMapsGraph</a>();</div>
<div class="line"><a name="l00949"></a><span class="lineno">  949</span>&#160;</div>
<div class="line"><a name="l00950"></a><span class="lineno">  950</span>&#160;        <span class="keyword">virtual</span> <span class="keyword">const</span> T * <a class="code" href="classBitMapsGraph.html#a6ced3297cea56a041748f46fda401017" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">neig</a>(<span class="keywordtype">long</span> i) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00951"></a><span class="lineno">  951</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * <a class="code" href="classBitMapsGraph.html#afd403f8f485420ed94b27185b9fb56e9" title="Create a clone of the current graph.">clone</a>() <span class="keyword">const</span>;</div>
<div class="line"><a name="l00952"></a><span class="lineno">  952</span>&#160;</div>
<div class="line"><a name="l00953"></a><span class="lineno">  953</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsGraph.html#a519a67a3969ea68fdeb00dc617fd70ca">nedges</a>();</div>
<div class="line"><a name="l00954"></a><span class="lineno">  954</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#a758804ca09b01ed02162a37d2eb93569" title="Adds an edge between the two specified vertices (optional operation).">addEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00955"></a><span class="lineno">  955</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#ae07bf761cd2bbe81f6625ac28ae243f9" title="Deletes the edge defined by the two specified vertices (optional operation).">delEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00956"></a><span class="lineno">  956</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#ae3e177fc813c7dd386bf6ff6ebcc6434" title="Swap the edge represented by the specified ordered pair (optional operation).">flipEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00957"></a><span class="lineno">  957</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#ac27ea0fd1c32a724bce7b7575a1fb068" title="Adds all possible edges (optional operation).">addAllEdges</a>();</div>
<div class="line"><a name="l00958"></a><span class="lineno">  958</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#af76b4fc534152fc0d2862153ccb76a76" title="Removes all possible edges (optional operation).">delAllEdges</a>();</div>
<div class="line"><a name="l00959"></a><span class="lineno">  959</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classBitMapsGraph.html#ad047e77073345f44b2f5f7327c1bb5ca" title="Queries for an edge.">hasEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00960"></a><span class="lineno">  960</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#a5dfaef1d7733c6a6dc5dd323aad9ddb8" title="Joins the neighborhood of two specified vertices (optional operation).">joinAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00961"></a><span class="lineno">  961</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#a210358944c413934020687c4c20b8a80" title="Calculates the common neighborhood of specified vertices (optional operation)">commonAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00962"></a><span class="lineno">  962</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#ae762e6472ff1d7025858acfda770407e" title="Removes from the neighborhood of one specified vertex the neighbors of a second specified vertex (opt...">diffAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j);</div>
<div class="line"><a name="l00963"></a><span class="lineno">  963</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsGraph.html#aba76fdc92a17e448e2df54a784fd0ef0" title="Computes the number of edges.">countnedges</a>();</div>
<div class="line"><a name="l00964"></a><span class="lineno">  964</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsGraph.html#aaacbd6e71eb3a831c85941fde733a7b1" title="The number of neighbors of a specified vertex.">degree</a>(<span class="keywordtype">long</span> i) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00965"></a><span class="lineno">  965</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsGraph.html#a39bdb364484e5f7d7c4b08ec0a0a9cec" title="The number of anti-neighbors of a specified vertex.">antiDegree</a>(<span class="keywordtype">long</span> i) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00966"></a><span class="lineno">  966</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * <a class="code" href="classBitMapsGraph.html#a8308462bdb32c5007930af4a350735d6" title="Create the square of the current graph.">square</a>() <span class="keyword">const</span>;</div>
<div class="line"><a name="l00967"></a><span class="lineno">  967</span>&#160;</div>
<div class="line"><a name="l00968"></a><span class="lineno">  968</span>&#160;};</div>
<div class="line"><a name="l00969"></a><span class="lineno">  969</span>&#160;</div>
<div class="line"><a name="l00970"></a><span class="lineno">  970</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00971"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#a8593a9905142dd840900e5028d992706">  971</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapsGraph.html#a8593a9905142dd840900e5028d992706">BitMapsGraph&lt;T&gt;::BitMapsGraph</a>(T * <span class="keyword">set</span>) : <a class="code" href="classGraph.html">Graph</a>&lt;T&gt;(set-&gt;universeSize()), factory(NULL), adj(new T*[n]) {</div>
<div class="line"><a name="l00972"></a><span class="lineno">  972</span>&#160;        <span class="keywordtype">long</span> <span class="keywordtype">long</span> nn = <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>*<a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>;</div>
<div class="line"><a name="l00973"></a><span class="lineno">  973</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; nn; i+=<a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>)</div>
<div class="line"><a name="l00974"></a><span class="lineno">  974</span>&#160;                <a class="code" href="classBitMapsGraph.html#ab6c15b269fb996d001857cd7354138f2" title="The adjacent matrix of the graph.">adj</a>[i] = (T *) <span class="keyword">set</span>-&gt;subset(i, i+n);</div>
<div class="line"><a name="l00975"></a><span class="lineno">  975</span>&#160;        <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a> = <a class="code" href="classBitMapsGraph.html#aba76fdc92a17e448e2df54a784fd0ef0" title="Computes the number of edges.">countnedges</a>();</div>
<div class="line"><a name="l00976"></a><span class="lineno">  976</span>&#160;}</div>
<div class="line"><a name="l00977"></a><span class="lineno">  977</span>&#160;</div>
<div class="line"><a name="l00978"></a><span class="lineno">  978</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00979"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#a1ca47790b427c243a9970b87355e79ea">  979</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapsGraph.html#a8593a9905142dd840900e5028d992706">BitMapsGraph&lt;T&gt;::BitMapsGraph</a>(<span class="keywordtype">long</span> n, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory) : <a class="code" href="classGraph.html">Graph</a>&lt;T&gt;(n), factory(factory), adj(new T*[n]) {</div>
<div class="line"><a name="l00980"></a><span class="lineno">  980</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>; i++)</div>
<div class="line"><a name="l00981"></a><span class="lineno">  981</span>&#160;                <a class="code" href="classBitMapsGraph.html#ab6c15b269fb996d001857cd7354138f2" title="The adjacent matrix of the graph.">adj</a>[i] = (T *) factory-&gt;<a class="code" href="classFactory.html#a0ed0b3527539a0631d8147d8aa94b75a">newInstance</a>(n);</div>
<div class="line"><a name="l00982"></a><span class="lineno">  982</span>&#160;        <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a> = 0;</div>
<div class="line"><a name="l00983"></a><span class="lineno">  983</span>&#160;}</div>
<div class="line"><a name="l00984"></a><span class="lineno">  984</span>&#160;</div>
<div class="line"><a name="l00985"></a><span class="lineno">  985</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00986"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#a6cb6e3e665459f5cd7b5384844e317a9">  986</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapsGraph.html#a8593a9905142dd840900e5028d992706">BitMapsGraph&lt;T&gt;::BitMapsGraph</a>(<span class="keywordtype">long</span> n, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">void</span> * handle) : <a class="code" href="classGraph.html">Graph</a>&lt;T&gt;(n), factory(factory), adj(new T*[n]) {</div>
<div class="line"><a name="l00987"></a><span class="lineno">  987</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>; i++)</div>
<div class="line"><a name="l00988"></a><span class="lineno">  988</span>&#160;                <a class="code" href="classBitMapsGraph.html#ab6c15b269fb996d001857cd7354138f2" title="The adjacent matrix of the graph.">adj</a>[i] = (T *) factory-&gt;<a class="code" href="classFactory.html#a0ed0b3527539a0631d8147d8aa94b75a">newInstance</a>(n, handle);</div>
<div class="line"><a name="l00989"></a><span class="lineno">  989</span>&#160;        <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a> = <a class="code" href="classBitMapsGraph.html#aba76fdc92a17e448e2df54a784fd0ef0" title="Computes the number of edges.">countnedges</a>();</div>
<div class="line"><a name="l00990"></a><span class="lineno">  990</span>&#160;}</div>
<div class="line"><a name="l00991"></a><span class="lineno">  991</span>&#160;</div>
<div class="line"><a name="l00992"></a><span class="lineno">  992</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l00993"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#ae469fe859ae3ca91ff2fcab18b3744b2">  993</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapsGraph.html#a8593a9905142dd840900e5028d992706">BitMapsGraph&lt;T&gt;::BitMapsGraph</a>(<span class="keywordtype">long</span> n, <a class="code" href="classFactory.html">Factory&lt;T&gt;</a> * factory, <span class="keywordtype">void</span>** handle) : <a class="code" href="classGraph.html">Graph</a>(n), factory(factory), adj(new T*[n]) {</div>
<div class="line"><a name="l00994"></a><span class="lineno">  994</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classDiGraph.html#a96f68a636f97b7144bd329c76ee51122" title="number of vertices in the graph">n</a>; i++)</div>
<div class="line"><a name="l00995"></a><span class="lineno">  995</span>&#160;                <a class="code" href="classBitMapsGraph.html#ab6c15b269fb996d001857cd7354138f2" title="The adjacent matrix of the graph.">adj</a>[i] = (T *) factory-&gt;<a class="code" href="classFactory.html#a0ed0b3527539a0631d8147d8aa94b75a">newInstance</a>(n, handle[i]);</div>
<div class="line"><a name="l00996"></a><span class="lineno">  996</span>&#160;        <a class="code" href="classDiGraph.html#ac325300072ce8b36dcfd5c7216cf735a" title="number of edges">m</a> = <a class="code" href="classBitMapsGraph.html#aba76fdc92a17e448e2df54a784fd0ef0" title="Computes the number of edges.">countnedges</a>();</div>
<div class="line"><a name="l00997"></a><span class="lineno">  997</span>&#160;}</div>
<div class="line"><a name="l00998"></a><span class="lineno">  998</span>&#160;</div>
<div class="line"><a name="l00999"></a><span class="lineno">  999</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01000"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#a85623f92cd881b813487e7af31b98ed7"> 1000</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classBitMapsGraph.html#a85623f92cd881b813487e7af31b98ed7">BitMapsGraph&lt;T&gt;::~BitMapsGraph</a>() {</div>
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; n; i++)</div>
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160;                <span class="keyword">delete</span> adj[i];</div>
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;        <span class="keyword">delete</span>[] adj;</div>
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>&#160;}</div>
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160;</div>
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01007"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#a6ced3297cea56a041748f46fda401017"> 1007</a></span>&#160;<span class="keyword">inline</span> <span class="keyword">const</span> T * <a class="code" href="classBitMapsGraph.html#a6ced3297cea56a041748f46fda401017" title="Retrieves the neighborhood of a specified vertex as an unmodifiable DirectlyAddressedSet.">BitMapsGraph&lt;T&gt;::neig</a>(<span class="keywordtype">long</span> i)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>&#160;        <span class="keywordflow">return</span> (<span class="keyword">const</span> T *) adj[i]-&gt;subset(0, adj[i]-&gt;universeSize());</div>
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>&#160;}</div>
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>&#160;</div>
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01012"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#afd403f8f485420ed94b27185b9fb56e9"> 1012</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * <a class="code" href="classBitMapsGraph.html#afd403f8f485420ed94b27185b9fb56e9" title="Create a clone of the current graph.">BitMapsGraph&lt;T&gt;::clone</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>&#160;        <span class="comment">//TODO</span></div>
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>&#160;        <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph</a> * g = <span class="keyword">new</span> <a class="code" href="classBitMapDiGraph.html">BitMapDiGraph&lt;T&gt;</a>(n);</div>
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>&#160;        <span class="keywordflow">return</span> g;</div>
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>&#160;}</div>
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>&#160;</div>
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01019"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#a5dfaef1d7733c6a6dc5dd323aad9ddb8"> 1019</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#a5dfaef1d7733c6a6dc5dd323aad9ddb8" title="Joins the neighborhood of two specified vertices (optional operation).">BitMapsGraph&lt;T&gt;::joinAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>&#160;        adj[i]-&gt;addAll(adj[j]);</div>
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>&#160;</div>
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a> * it = adj[j]-&gt;newIterator();</div>
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160;        <span class="keywordtype">long</span> l = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160;        <span class="keywordtype">long</span> iu = adj[j]-&gt;universeSize();</div>
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>&#160;        <span class="keywordflow">while</span> (l &lt; iu) {</div>
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160;                addEdge(l, i);</div>
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>&#160;                it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>&#160;        }</div>
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>&#160;}</div>
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>&#160;</div>
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01032"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#a210358944c413934020687c4c20b8a80"> 1032</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#a210358944c413934020687c4c20b8a80" title="Calculates the common neighborhood of specified vertices (optional operation)">BitMapsGraph&lt;T&gt;::commonAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>&#160;        adj[i]-&gt;retainAll(adj[j]);</div>
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>&#160;</div>
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a> * it = adj[i]-&gt;newComplIterator();</div>
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>&#160;        <span class="keywordtype">long</span> l = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>&#160;        <span class="keywordtype">long</span> iu = adj[i]-&gt;universeSize();</div>
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>&#160;        <span class="keywordflow">while</span> (l &lt; iu) {</div>
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160;                delEdge(l, i);</div>
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160;                it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>&#160;        }</div>
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160;}</div>
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>&#160;</div>
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01045"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#ae762e6472ff1d7025858acfda770407e"> 1045</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#ae762e6472ff1d7025858acfda770407e" title="Removes from the neighborhood of one specified vertex the neighbors of a second specified vertex (opt...">BitMapsGraph&lt;T&gt;::diffAdj</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160;        adj[i]-&gt;removeAll(adj[j]);</div>
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160;</div>
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160;        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a> * it = adj[i]-&gt;newComplIterator();</div>
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>&#160;        <span class="keywordtype">long</span> l = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160;        <span class="keywordtype">long</span> iu = adj[i]-&gt;universeSize();</div>
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>&#160;        <span class="keywordflow">while</span> (l &lt; iu) {</div>
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>&#160;                delEdge(l, i);</div>
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>&#160;                it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>&#160;        }</div>
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>&#160;}</div>
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>&#160;</div>
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01058"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#aba76fdc92a17e448e2df54a784fd0ef0"> 1058</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsGraph.html#aba76fdc92a17e448e2df54a784fd0ef0" title="Computes the number of edges.">BitMapsGraph&lt;T&gt;::countnedges</a>() {</div>
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>&#160;        m = 0;</div>
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; n; i++)</div>
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>&#160;                m += adj[i]-&gt;cardOfSet();</div>
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>&#160;        <span class="keywordflow">return</span> m;</div>
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>&#160;}</div>
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>&#160;</div>
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01066"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#a758804ca09b01ed02162a37d2eb93569"> 1066</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#a758804ca09b01ed02162a37d2eb93569" title="Adds an edge between the two specified vertices (optional operation).">BitMapsGraph&lt;T&gt;::addEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>&#160;        adj[i]-&gt;toSet(j);</div>
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>&#160;        adj[j]-&gt;toSet(i);</div>
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>&#160;}</div>
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>&#160;</div>
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01072"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#ae07bf761cd2bbe81f6625ac28ae243f9"> 1072</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#ae07bf761cd2bbe81f6625ac28ae243f9" title="Deletes the edge defined by the two specified vertices (optional operation).">BitMapsGraph&lt;T&gt;::delEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>&#160;        adj[i]-&gt;toCompl(j);</div>
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>&#160;        adj[j]-&gt;toCompl(i);</div>
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>&#160;}</div>
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>&#160;</div>
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01078"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#ae3e177fc813c7dd386bf6ff6ebcc6434"> 1078</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#ae3e177fc813c7dd386bf6ff6ebcc6434" title="Swap the edge represented by the specified ordered pair (optional operation).">BitMapsGraph&lt;T&gt;::flipEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j) {</div>
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>&#160;        adj[i]-&gt;flip(j);</div>
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>&#160;        adj[j]-&gt;flip(i);</div>
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>&#160;}</div>
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>&#160;</div>
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01084"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#ad047e77073345f44b2f5f7327c1bb5ca"> 1084</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classBitMapsGraph.html#ad047e77073345f44b2f5f7327c1bb5ca" title="Queries for an edge.">BitMapsGraph&lt;T&gt;::hasEdge</a>(<span class="keywordtype">long</span> i, <span class="keywordtype">long</span> j)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>&#160;        <span class="keywordflow">return</span> adj[i]-&gt;isInSet(j);</div>
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>&#160;}</div>
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>&#160;</div>
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01089"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#ac27ea0fd1c32a724bce7b7575a1fb068"> 1089</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#ac27ea0fd1c32a724bce7b7575a1fb068" title="Adds all possible edges (optional operation).">BitMapsGraph&lt;T&gt;::addAllEdges</a>() {</div>
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; n; i++)</div>
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>&#160;                adj[i]-&gt;allToSet();</div>
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>&#160;}</div>
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>&#160;</div>
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01095"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#af76b4fc534152fc0d2862153ccb76a76"> 1095</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classBitMapsGraph.html#af76b4fc534152fc0d2862153ccb76a76" title="Removes all possible edges (optional operation).">BitMapsGraph&lt;T&gt;::delAllEdges</a>() {</div>
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; n; i++)</div>
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>&#160;                adj[i]-&gt;allToCompl();</div>
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>&#160;}</div>
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>&#160;</div>
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01101"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#aaacbd6e71eb3a831c85941fde733a7b1"> 1101</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsGraph.html#aaacbd6e71eb3a831c85941fde733a7b1" title="The number of neighbors of a specified vertex.">BitMapsGraph&lt;T&gt;::degree</a>(<span class="keywordtype">long</span> i)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>&#160;        <span class="keywordflow">return</span> adj[i]-&gt;cardOfSet();</div>
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>&#160;}</div>
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>&#160;</div>
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01106"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#a39bdb364484e5f7d7c4b08ec0a0a9cec"> 1106</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classBitMapsGraph.html#a39bdb364484e5f7d7c4b08ec0a0a9cec" title="The number of anti-neighbors of a specified vertex.">BitMapsGraph&lt;T&gt;::antiDegree</a>(<span class="keywordtype">long</span> i)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>&#160;        <span class="keywordflow">return</span> n - adj[i]-&gt;cardOfSet() - 1;</div>
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>&#160;}</div>
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>&#160;</div>
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;</div>
<div class="line"><a name="l01111"></a><span class="lineno"><a class="code" href="classBitMapsGraph.html#a8308462bdb32c5007930af4a350735d6"> 1111</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * <a class="code" href="classBitMapsGraph.html#a8308462bdb32c5007930af4a350735d6" title="Create the square of the current graph.">BitMapsGraph&lt;T&gt;::square</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>&#160;        <span class="comment">//clone the current graph</span></div>
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>&#160;        <a class="code" href="classDiGraph.html">DiGraph&lt;T&gt;</a> * g = clone();</div>
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>&#160;</div>
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>&#160;        <span class="comment">//add the transitive edges</span></div>
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>&#160;                <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet.">DirectlyAddressedSet::Iterator</a> * it = adj[i]-&gt;newIterator();</div>
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>&#160;                <span class="keywordtype">long</span> iu = adj[i]-&gt;universeSize();</div>
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>&#160;                <span class="keywordtype">long</span> j = it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>&#160;                <span class="keywordflow">while</span> (j &lt; iu) {</div>
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>&#160;                        g-&gt;<a class="code" href="classDiGraph.html#a23cd28b2e17258697a7575fd60d94da9" title="the adjacent matrix of the graph">adj</a>[i]-&gt;addAll(adj[j]);</div>
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>&#160;                        it-&gt;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#ab3ef5a45f421b1f1b2875e60977aafc7" title="Enumerates the first key in the set next to the current cursor position.">next</a>();</div>
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>&#160;                }</div>
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>&#160;        }</div>
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>&#160;        <span class="keywordflow">return</span> g;</div>
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>&#160;}</div>
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>&#160;</div>
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> D&gt;</div>
<div class="line"><a name="l01132"></a><span class="lineno"><a class="code" href="classDiGraphFactory.html"> 1132</a></span>&#160;<span class="keyword">class </span><a class="code" href="classDiGraphFactory.html">DiGraphFactory</a> : <span class="keyword">public</span> <a class="code" href="classFactory.html">Factory</a>&lt;DiGraph&lt;D&gt; &gt; {</div>
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l01134"></a><span class="lineno"><a class="code" href="classDiGraphFactory.html#af2e35be1333795513a9ce59f333155f1"> 1134</a></span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraphFactory.html#af2e35be1333795513a9ce59f333155f1">~DiGraphFactory</a>() {};</div>
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>&#160;</div>
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph&lt;D&gt;</a> * <a class="code" href="classDiGraphFactory.html#a2df21924f1e6c73a624d112ff9a0f2c3">newInstance</a>(<span class="keywordtype">long</span> n) = 0;</div>
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers.">DiGraph&lt;D&gt;</a> * <a class="code" href="classDiGraphFactory.html#a2df21924f1e6c73a624d112ff9a0f2c3">newInstance</a>(<span class="keywordtype">long</span> n, <span class="keywordtype">void</span> * handle) = 0;</div>
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>&#160;};</div>
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>&#160;</div>
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/* GRAPH_H_ */</span><span class="preprocessor"></span></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Mon Nov 26 2012 17:06:45 for Data Structures for Sets and Graphs by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.1.1
</small></address>
</body>
</html>
